FINITE SETS WITH FAKE OBSERVABLE CARDINALITY
نویسندگان
چکیده
منابع مشابه
Cardinality for Infinite Sets
How can we determine whether two sets have the same cardinality (or “size”)? The answer to this question, reassuringly, lies in early grade school memories: by demonstrating a pairing between elements of the two sets. More formally, we need to demonstrate a bijection f between the two sets. The bijection sets up a one-to-one correspondence, or pairing, between elements of the two sets. We know ...
متن کاملPolynomial Constraints for Sets with Cardinality Bounds
Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents a class of constraints on sets and their cardinalities for which the satisfiability and the entailment problems are computable in polynomial time. Our class of constraints, based on tree-shaped formulas, is unique in being simul...
متن کاملOn Cardinality of Fuzzy Sets
In this article, we would like to revisit and comment on the widely used definition of cardinality of fuzzy sets. For this purpose we have given a brief description of the history of development of fuzzy cardinality. In the process, we can find that the existing definition fails to give a proper cardinality while dealing with complementation of fuzzy sets. So there arises the need of defining t...
متن کاملFake Boundary Sets in the Hilbert Cube
For each positive integer n, a o-Z-set B„ in the Hilbert cube 7°° is constructed whose complement s„ = Ix — B„ is not homeomorphic to the pseudointerior j of the Hilbert cube though sn and B„ satisfy: (i) every compact subset of s„ is a Z-set in s„; (ii) s„ X s„ is homeomorphic to s; (iii) Bn admits small maps 7°° -» B„; (iv) s„ satisfies the discrete «-cells property; and (v) Bn is locally (n ...
متن کاملOn Algorithms and Complexity for Sets with Cardinality Constraints
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate properties: relationships between the typestates of objects can be expressed as subset and disjointness relations on sets, and elements of sets can be represe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2015
ISSN: 1015-8634
DOI: 10.4134/bkms.2015.52.1.323